منابع مشابه
Further gossip problems
n people have distinct bits of information. They can communicate via k-party conference calls. I-Iow many such calls are needed to inform everyone of everyone else’s information? Let f(n, k) be this minimum number. Then we give a simple proof that f(n, k)= [(n-k)(k-l)] + [n k] for lGnsk2, f(n, k)=2[(n-k)(k-l)] for n>k2. In the 2-party case we consider the case in which certain of the calls may ...
متن کاملParameters for Epistemic Gossip Problems
We introduce a framework that can model different kinds of epistemic gossip problems. We also formalize some parameters that distinguish the different types of gossip problem. Finally, we present a few results that show the effect of the parameters.
متن کاملGossip Algorithms for Heterogeneous Multi-Vehicle Routing Problems
In this paper we address a class of heterogeneous multi-vehicle task assignment and routing problem. We propose two distributed algorithms based on gossip communication: the first algorithm is based on a local exact optimization and the second is based on a local approximate greedy heuristic. We consider the case where a set of heterogeneous tasks arbitrarily distributed in a plane has to be se...
متن کاملAsynchronous Gossip-Based Random Projection Algorithms for Fully Distributed Problems
We consider fully distributed constrained convex optimization problems over a network, where each network agent has a distinct objective and constraint set. We discuss a gossipbased random projection algorithm (GRP) with uncoordinated diminishing stepsizes. We prove that, when the problem has a solution, the iterates of all network agents converge to the same optimal point with probability 1.
متن کاملA Gossip Algorithm for Heterogeneous Multi-Vehicle Routing Problems
In this paper we address the heterogeneous multi-vehicle routing problem by proposing a distributed algorithm based on gossip. We consider the case where a set of tasks arbitrarily distributed in a plane, each with a service cost, have to be served by a set of mobile robots, each with a given movement speed and task execution speed. Our goal is to minimize the maximum execution time of robots.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1980
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90116-8